Planar Graph Coloring
نویسنده
چکیده
We show that the game chromatic number of a planar graph is at most 33. More generally, there exists a function f: f\l --+ f\l so that for each n E f\l. if a graph does not contain a homeomorph of Kn• then its game chromatic number is at most f(n). In particular, the game chromatic number of a graph is bounded in terms of its genus. Our proof is motivated by the concept of p-arrangeability, which was first introduced by Guantao and Schelp in a Ramsey theoretic setting. © 1994 John Wiley & Sons, Inc.
منابع مشابه
List VEF Coloring of Planar Graphs
In this paper the new coloring of planar, VEF-coloring, will be introduced. A VEF coloring of a simple planar graph G is a proper coloring of all elements, including vertices, edges and faces of G. We will give two conjectures for the upper bound of VEF and VEF-list coloring of a simple planar graph. However, we will prove these conjectures for planar graphs with a maximum degree of at least 12...
متن کاملStar coloring planar graphs from small lists
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every planar graph of girth 6 (respectively 7,8) can be star colored from lists of size 8 (respectively 7,6). We give an example of a planar graph of girth 5 that requires 6 colors to star color.
متن کاملStar coloring bipartite planar graphs
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least 8 colors to star color.
متن کاملAcyclic edge-coloring of planar graphs: ∆ colors suffice when ∆ is large
An acyclic edge-coloring of a graph G is a proper edge-coloring of G such that the subgraph induced by any two color classes is acyclic. The acyclic chromatic index, χa(G), is the smallest number of colors allowing an acyclic edge-coloring of G. Clearly χa(G) ≥ ∆(G) for every graph G. Cohen, Havet, and Müller conjectured that there exists a constant M such that every planar graph with ∆(G) ≥M h...
متن کاملPlanar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while ensuring that two edges that are incident receive different colors. A graph is k-edge-choosable if for any assignment of k colors to every edge, there is an edge coloring such that the color of every edge belongs to its color assignment. Vizing conjectured in 1965 that every...
متن کاملPlanar Graph Coloring is not Self-Reducible, Assuming P != NP
We show that obtaining the lexicographically first four coloring of a planar graph is NP–hard. This shows that planar graph four-coloring is not self-reducible, assuming P 6= NP . One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number of four colorings of a planar graph. These results extend to planar graph k-coloring, for k ≥ 4. Resear...
متن کامل